Relativized counting classes: Relations among thresholds, parity, and mods
نویسندگان
چکیده
منابع مشابه
Relativized Counting Classes: Relations among Thresholds, Parity, and Mods
Well known complexity classes such as NP, co-NP, P (PARITY-P), and PP are produced by considering a nondeterministic polynomial time Turing machine N and deening acceptance in terms of the number of accepting paths in N. That is, they are subclasses of P #PP1]. Other interesting classes such as MOD k P and C = P are also subclasses of P #PP1]. Many relations among these classes are unresolved. ...
متن کاملCounting Classes: Thresholds, Parity, Mods, and Fewness
Counting classes consist of languages deened in terms of the number of accepting computations of nondeterministic polynomial-time Turing machines. Well known examples of counting classes are NP, co-NP, P, and PP. Every counting class is a subset of P #PP1] , the class of languages computable in polynomial time using a single call to an oracle capable of determining the number of accepting paths...
متن کاملOn relations between counting communication complexity classes
We develop upper and lower bound arguments for counting acceptance modes of communication protocols. A number of separation results for counting communication complexity classes is established. This extends the investigation of the complexity of communication between two processors in terms of complexity classes initiated by Babai, Frankl, and Simon [Proc. 27th IEEE FOCS 1986, pp. 337{347] and ...
متن کاملCircuit Lower Bounds Collapse Relativized Complexity Classes
Since the publication of Furst, Saxe, and Sipser's seminal paper connecting AC 0 with the polynomial hierarchy FSS84], it has been well known that circuit lower bounds allow you to construct oracles that separate complexity classes. We will show that similar circuit lower bounds allow you to construct oracles that collapse complexity classes. For example, based on H astad's parity lower bound, ...
متن کاملCapturing Relativized Complexity Classes without Order
We consider the problem of obtaining logical characterisations of oracle complexity classes. In particular, we consider the complexity classes LOGSPACE NP and PTIME NP. For these classes, characterisations are known in terms of NP computable Lindstrr om quantiiers which hold on ordered structures. We show that these charac-terisations are unlikely to extend to arbitrary (unordered) structures, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1991
ISSN: 0022-0000
DOI: 10.1016/0022-0000(91)90040-c